全文获取类型
收费全文 | 240篇 |
免费 | 1篇 |
国内免费 | 4篇 |
专业分类
化学 | 35篇 |
力学 | 2篇 |
综合类 | 2篇 |
数学 | 158篇 |
物理学 | 48篇 |
出版年
2023年 | 4篇 |
2022年 | 3篇 |
2021年 | 2篇 |
2020年 | 6篇 |
2019年 | 7篇 |
2018年 | 9篇 |
2017年 | 5篇 |
2016年 | 4篇 |
2015年 | 5篇 |
2014年 | 6篇 |
2013年 | 11篇 |
2012年 | 16篇 |
2011年 | 22篇 |
2010年 | 13篇 |
2009年 | 18篇 |
2008年 | 13篇 |
2007年 | 15篇 |
2006年 | 17篇 |
2005年 | 11篇 |
2004年 | 8篇 |
2003年 | 8篇 |
2002年 | 7篇 |
2001年 | 10篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1985年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有245条查询结果,搜索用时 31 毫秒
1.
Pre—Separation Axioms in Fuzzifying Topology 总被引:1,自引:0,他引:1
K.M.AbdEl-Hakeim F.M.Zeyada 《模糊系统与数学》2003,17(1):28-36
1 IntroductionYing[5,6 ] introduced and elementally developed so called fuzzifying topology with the semanticmethod of continuous valued L ogic.Shen[7] introduced and studied T0 -,T1-,T2 (Hausdorff) -,T3(regularity) -,T4 (normality) -separation axioms in fuzzifying topology.In [3 ]the concepts of thefamily of fuzzifying pre-open sets,fuzzifying pre-neighbourhood structure of a point and fuzzifyingpre-closure are introduced and studied.It is worth to mention that pre-separation axioms are … 相似文献
2.
基于伽罗瓦连接,分别在交换伴随对与对合剩余格条件下,讨论了模糊概念格的四种定义形式。并证明了在对合剩余格上,对偶性成立,四种模糊算子将具有与经典意义下一致的相互关系。最后我们提出了一种基于模糊概念格的模糊推理规则,并证明了其还原性。 相似文献
3.
以L~*-格值上Lukasiewicz蕴含算子为工具引入了直觉I-Fuzzy拓扑空间中导集概念,接着给出它的一些性质,最后证明了直觉I-Fuzzy拓扑空间中导集的杨忠道定理. 相似文献
4.
5.
We described the design and synthesis of a colorimetric and ratiometric fluorescent probe based on a conjugated π-electron system that displayed differential fluorescence responses towards cyanide and sulfide and demonstrated its utility in intracellular ion imaging and logic gate. 相似文献
6.
A novel photochromic Schiff base derivative, 5,17-N,N′-(5,5′-di-methoxyl-benzlaldehyde)diimine-25,27-dipropoxy-calix[4]arene has been synthesized through incorporation of two imine groups into the upper rims of calix[4]arene. The experiments showed that the addition of Dy3+ or Er3+ ions to compound 4 results in the solution color change, but other metal ions caused less change. It indicated that the synthetic receptor can selectively recognize Dy3+ and Er3+ ion by naked eye over other lanthanide cations. Thus, these systems can be applied as chemosensor for Dy3+ and Er3+ ion in analytical chemistry. 相似文献
7.
基于经典命题逻辑的真度理论,讨论了经典命题逻辑系统当中公式集的约简问题。提出了真度约简及α-真度约简的概念,为公式集的约简提供了一种可行的操作方法。 相似文献
8.
The concept, the present status, key issues and future prospects of a novel hexagonal binary decision diagram (BDD) quantum circuit approach for III–V quantum large-scale integrated circuits (QLSIs) are presented and discussed. In this approach, the BDD logic circuits are implemented on III–V semiconductor-based hexagonal nanowire networks controlled by nanoscale Schottky gates. The hexagonal BDD QLSIs can operate at delay-power products near the quantum limit in the quantum regime as well as in the many-electron classical regime. To demonstrate the feasibility of the present approach, GaAs Schottky wrap gate (WPG)-based single-electron BDD node devices and their integrated circuits were fabricated and their proper operations were confirmed. Selectively grown InGaAs sub-10 nm quantum wires and their hexagonal networks have been investigated to form high-density hexagonal BDD QLSIs operating in the quantum regime at room temperature. 相似文献
9.
Read-once functions have gained recent, renewed interest in the fields of theory and algorithms of Boolean functions, computational learning theory and logic design and verification. In an earlier paper [M.C. Golumbic, A. Mintz, U. Rotics, Factoring and recognition of read-once functions using cographs and normality, and the readability of functions associated with partial k-trees, Discrete Appl. Math. 154 (2006) 1465-1677], we presented the first polynomial-time algorithm for recognizing and factoring read-once functions, based on a classical characterization theorem of Gurvich which states that a positive Boolean function is read-once if and only if it is normal and its co-occurrence graph is P4-free.In this note, we improve the complexity bound by showing that the method can be modified slightly, with two crucial observations, to obtain an O(n|f|) implementation, where |f| denotes the length of the DNF expression of a positive Boolean function f, and n is the number of variables in f. The previously stated bound was O(n2k), where k is the number of prime implicants of the function. In both cases, f is assumed to be given as a DNF formula consisting entirely of the prime implicants of the function. 相似文献
10.